Subtypes for Speci cations : Predicate
نویسندگان
چکیده
|A speciication language used in the context of an eeective theorem prover can provide novel features that enhance precision and expressiveness. In particular, type-checking for the language can exploit the services of the theorem prover. We describe a feature called \predicate subtyping" that uses this capability and illustrate its utility as mechanized in PVS.
منابع مشابه
Subtypes for Speci cations ?
Speciication languages are best used in environments that provide eeective theorem proving. Having such support available, it is feasible to contemplate forms of typechecking that can use the services of a theorem prover. This allows interesting extensions to the type systems provided for speciication languages. I describe one such extension called \predicate subtyping" and illustrate its utili...
متن کاملSynthesizing Procedural Abstractions from Formal Speci cationsBetty
Synthesizing Procedural Abstractions from Formal Speci cations Betty H.C. Cheng Department of Computer Science Michigan State University East Lansing, Michigan 48824 Abstract This paper describes the development of the Seed system, which demonstrates that the building blocks of a large software system can be correctly synthesized from user-supplied formal speci cations using techniques amenable...
متن کاملTyped Homomorphic Relations Extended with Subtypes
Typed homomorphic relations on heterogeneous algebras are generalized to allow relationships between elements in the carrier sets of di erent types. Such relations are needed for the model theory of incomplete, hierarchical speci cations with subtypes. Typed logical relations are generalized similarly. These tools help give a simple model-theoretic account of subtyping among abstract data types...
متن کاملAnnotating a Japanese Text Corpus with Predicate-Argument and Coreference Relations
In this paper, we discuss how to annotate coreference and predicate-argument relations in Japanese written text. There have been research activities for building Japanese text corpora annotated with coreference and predicate-argument relations as are done in the Kyoto Text Corpus version 4.0 (Kawahara et al., 2002) and the GDATagged Corpus (Hasida, 2005). However, there is still much room for r...
متن کاملBehavioral Subtyping Using Invariants and Constraints
We present a way of de ning the subtype relation that ensures that subtype objects preserve behavioral properties of their supertypes. The subtype relation is based on the speci cations of the suband supertypes. Our approach handles mutable types and allows subtypes to have more methods than their supertypes. Dealing with mutable types and subtypes that extend their supertypes has surprising co...
متن کامل